منابع مشابه
DISCRETE MATHEMATICS Line hypergraphs
In this paper, we introduce a new multivalued function ~ called the line hypergraph. The function ~ generalizes two classical concepts at once, namely, of the line graph and the dual hypergraph. In terms of this function, proofs of some known theorems on line graphs can be unified and their more general versions can be obtained. Three such theorems are considered here, namely, the Berge theorem...
متن کاملDiscrete Mathematics Number theory
The focus of this entire note is on positive integers. I will start by the basic notion of divisibility. We say that a divides b, or a is a divisor of b, or b is a multiple of a, if there exists an integer m such that b = am We also denote this by a | b (a divides b). If a is not a divisor of b, the we write a | b, but we can still talk about division by a with a remainder r. Given any two inte...
متن کاملAlgebra and discrete mathematics
In this work first we study the properties of nearsemirings to introduce an α-radical. Then we observe the role of near-semirings in generalized linear sequential machines, and we test the minimality through the radical.
متن کاملDiscrete Mathematics Graphs
In this section, I will introduce the preliminary language of graphs. A graph G = (V, E) consists of a set of vertices V and a set of edges E, where an edge is an unordered pair of vertices (although we could extend the definition to ordered to allow for directed graphs). A graph can be visually represented by making vertices points (or small circles), with some pairs (not necessarily all pairs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90075-5